Codes over Hurwitz integers

نویسنده

  • Murat Guzeltepe
چکیده

In this study, we obtain new classes of linear codes over Hurwitz integers equipped with a new metric. We refer to the metric as Hurwitz metric. The codes with respect to Hurwitz metric use in coded modulation schemes based on quadrature amplitude modulation (QAM)-type constellations, for which neither Hamming metric nor Lee metric. Also, we define decoding algorithms for these codes when up to two coordinates of a transmitted code vector are effected by error of arbitrary Hurwitz weight. AMS Classification: 94B05, 94B15, 94B35, 94B60

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Perfect Mannheim, Lipschitz and Hurwitz weight codes

The set of residue classes modulo an element π in the rings of Gaussian integers, Lipschitz integers and Hurwitz integers, respectively, is used as alphabets to form the words of error correcting codes. An error occurs as the addition of an element in a set E to the letter in one of the positions of a word. If E is a group of units in the original rings, then we obtain the Mannheim, Lipschitz a...

متن کامل

Codes over a subset of Octonion Integers

In this paper we define codes over some Octonion integers. We prove that in some conditions these codes can correct up to two errors for a transmitted vector and the code rate of the codes is grater than the code rate of the codes defined on some subset of Quaternion integers.

متن کامل

A Quaternionic Proof of the Universality of Some Quadratic Forms

The problem of finding all quadratic forms over Z that represent each positive integer received significant attention in a paper of Ramanujan in 1917. Exactly fifty four quaternary quadratic forms of this type without cross product terms were shown to represent all positive integers. The classical case of the quadratic form that is just the sum of four squares received an alternate proof by Hur...

متن کامل

Quarternions and the Four Square Theorem

The Four Square Theorem was proved by Lagrange in 1770: every positive integer is the sum of at most four squares of positive integers, i.e. n = A2 + B2 + C2 + D2, A, B, C, D ∈ Z An interesting proof is presented here based on Hurwitz integers, a subset of quarternions which act like integers in four dimensions and have the prime divisor property. It is analogous to Fermat’s Two Square Theorem,...

متن کامل

Some Generalizations of Good Integers and Their Applications in the Study of Self-Dual Negacyclic Codes

Good integers introduced in 1997 form an interesting family of integers that has been continuously studied due to their rich number theoretical properties and wide applications. In this paper, we have focused on classes of 2β-good integers, 2β-oddlygood integers, and 2β-evenly-good integers which are generalizations of good integers. Properties of such integers have been given as well as their ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete Mathematics

دوره 313  شماره 

صفحات  -

تاریخ انتشار 2013